Bin packing problem

Results: 81



#Item
41Advanced Algorithms – COMS31900Lecture 17 Approximation Algorithms (part two) more constant factor approximations

Advanced Algorithms – COMS31900Lecture 17 Approximation Algorithms (part two) more constant factor approximations

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:22
42Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with

Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:22
43Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if,

Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if,

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:22
44Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if,

Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if,

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:22
45Data Locality Problems and Colored Bin Packing Andy Twigg (Oxford), Eduardo Xavier (Campinas, Brazil) May 11, 2009  Andy Twigg (Oxford), Eduardo Xavier (Campinas, Brazil)

Data Locality Problems and Colored Bin Packing Andy Twigg (Oxford), Eduardo Xavier (Campinas, Brazil) May 11, 2009 Andy Twigg (Oxford), Eduardo Xavier (Campinas, Brazil)

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 07:07:11
46Advanced Algorithms – COMS31900Lecture 18 Approximation Algorithms (part three) (Fully) Polynomial Time Approximation Schemes

Advanced Algorithms – COMS31900Lecture 18 Approximation Algorithms (part three) (Fully) Polynomial Time Approximation Schemes

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:22
47NP-completeness recap Advanced Algorithms – COMS31900 • NP is the class of problems we can

NP-completeness recap Advanced Algorithms – COMS31900 • NP is the class of problems we can

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:21
    48Optimizing Web Traffic via the Media Scheduling Problem Lars Backstrom∗ Jon Kleinberg†  Ravi Kumar

    Optimizing Web Traffic via the Media Scheduling Problem Lars Backstrom∗ Jon Kleinberg† Ravi Kumar

    Add to Reading List

    Source URL: www.cs.cornell.edu

    Language: English - Date: 2009-04-30 22:46:44
    49Virtual Machine Consolidation in Cloud Data Centers using ACO Metaheuristic Md Hasanul Ferdaus1 , Manzur Murshed2 , Rodrigo N. Calheiros3 , Rajkumar Buyya3 1

    Virtual Machine Consolidation in Cloud Data Centers using ACO Metaheuristic Md Hasanul Ferdaus1 , Manzur Murshed2 , Rodrigo N. Calheiros3 , Rajkumar Buyya3 1

    Add to Reading List

    Source URL: www.cloudbus.org

    Language: English - Date: 2014-06-22 22:48:37
    50___________________________ Extreme Point-Based Heuristics for Three-Dimensional Bin Packing Teodor Gabriel Crainic Guido Perboli

    ___________________________ Extreme Point-Based Heuristics for Three-Dimensional Bin Packing Teodor Gabriel Crainic Guido Perboli

    Add to Reading List

    Source URL: www.cirrelt.ca

    Language: English - Date: 2007-10-23 14:47:14